Transitive Groups Involving Direct Products of Lower Degree

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Transitive Permutation Groups of Degree 32

We describe our successful computation of a list of representatives of the 2 801 324 conjugacy classes of transitive groups of degree 32.

متن کامل

Transitive Permutation Groups of Prime-Squared Degree

We explicitly determine all of the transitive groups of degree p2, p a prime, whose Sylow p-subgroup is not isomorphic to the wreath product Z p Z p . Furthermore, we provide a general description of the transitive groups of degree p2 whose Sylow p-subgroup is isomorphic to Z p Z p , and explicitly determine most of them. As applications, we solve the Cayley Isomorphism problem for Cayley objec...

متن کامل

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

متن کامل

The minimally transitive groups of degree up to 30

This list gives index numbers, generators and (for degree up to 15) names (following [CHM98]) for the minimally transitive groups of degree up to 30. Not listed are regular groups – these are obviously minimally transitive and can be easily constructed from a list of isomorphism types of groups. Also excluded are degrees which are prime or p2 – in this case all minimally transitive groups are r...

متن کامل

Independent sets in direct products of vertex-transitive graphs

Let G and H be two vertex-transitive graphs. It is easy to find that α(G × H) = |G||H | 2 if one of them is a bipartite graph. In this paper, we will identify the structure of the maximal-sized independent sets in G×H when one of them is a bipartite graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 1925

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.11.2.150